Core Multiplication 1 Running Head : CORE MULTIPLICATION Core Multiplication in Childhood

نویسندگان

  • Koleen McCrink
  • Elizabeth S. Spelke
چکیده

A dedicated, non-symbolic, system yielding imprecise representations of large quantities (Approximate Number System, or ANS) has been shown to support arithmetic calculations of addition and subtraction. In the present study, 5-7-year-old children without formal schooling in multiplication and division were given a task requiring a scalar transformation of large approximate numerosities, presented as arrays of objects. In different conditions, the required calculation was doubling, quadrupling, or increasing by a fractional factor (2.5). In all conditions, participants were able to represent the outcome of the transformation at above-chance levels, even on the earliest training trials. Their performance could not be explained by processes of repeated addition, and it showed the critical ratio signature of the ANS. These findings provide evidence for an untrained, intuitive process of calculating multiplicative numerical relationships, providing a further foundation for formal arithmetic instruction. *Manuscript Click here to view linked References

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Montgomery Modular Multiplication Algorithm for Multi-Core Systems

This paper presents an efficient software implementation of the Montgomery modular multiplication algorithm on a multi-core system. A prototype of general multi-core systems is designed with GEZEL. We propose a new instruction scheduling method for multi-core systems that can reduce the number of data transfers between different cores. Compared to the implementations on a single-core system, th...

متن کامل

A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

متن کامل

Efficient Sparse Matrix-Matrix Multiplication on Multicore Architectures∗

We describe a new parallel sparse matrix-matrix multiplication algorithm in shared memory using a quadtree decomposition. Our preliminary implementation is nearly as fast as the best sequential method on one core, and scales well to multiple cores.

متن کامل

Multipartite Modular Multiplication

Current processors typically embeds many cores running at high speed. We may then ask ourselves whether software parallelism is practical for low level arithmetic operations. In this paper we generalize the bipartite modular multiplication method of Kaihara and Takagi. We present a multipartite multiplication. We carefully analyze its asymptotic complexity and measure its practical efficiency a...

متن کامل

cient Sparse Matrix - Matrix Multiplication on Multicore Architectures ⇤

We describe a new parallel sparse matrix-matrix multiplication algorithm in shared memory using a quadtree decomposition. Our implementation is nearly as fast as the best sequential method on one core, and scales quite well to multiple cores.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010